
#include"BinaryTreeSearch.h"




int main()
{
	int arr[] = {5,6,7,9,1,3,4,2,9};
	BSTree<int> one;

	for (auto& a : arr)
	{
		one.insert(a);
	}
	one.InOrder();

	BSTreeNode<int> *tmp = one.find(9);

	for (auto& a : arr)
	{
		one.erase(a);
		one.InOrder();
	}

	

	return 0;
}



